Cyclic matrices of weighted digraphs

نویسنده

  • Ricardo Riaza
چکیده

We address in this paper several properties of so-called augmented cyclic matrices of weighted digraphs. These matrices arise in different applications of digraph theory to electrical circuit analysis, and can be seen as an enlargement of basic cyclic matrices of the form BWB , where B is a cycle matrix and W is a diagonal matrix of weights. By using certain matrix factorizations and some properties of cycle bases, we characterize the determinant of augmented cyclic matrices in terms of Cauchy-Binet expansions and, eventually, in terms of so-called proper cotrees. In the simpler context defined by basic cyclic matrices, we obtain a dual result of Maxwell’s determinantal expansion for weighted Laplacian (nodal) matrices. Additional relations with nodal matrices are also discussed. Finally, we apply this framework to the characterization of the differential-algebraic circuit models arising from loop analysis, and also to the analysis of branch-oriented models of circuits including charge-controlled memristors.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Average consensus on strongly connected weighted digraphs: A generalized error bound

This technical communique represents a generalization of the convergence analysis for the consensus algorithm proposed in Priolo et al. (2014). Although the consensus was reached for any strongly connected weighted digraphs (SCWD), the convergence analysis provided in Priolo et al. (2014) was only valid for diagonalizable matrices encoding a SCWD. The result we present here generalizes the prev...

متن کامل

Matrix inversion and digraphs: the one factor case

The novel concept of a cyclic sequence of a digraph that has precisely one factor is defined, and is used to characterize the entries of the inverse of a matrix with such a digraph. This leads to a characterization of a strongly sign-nonsingular matrix in terms of cyclic sequences. Nonsingular nearly reducible matrices are a well-known class of matrices having precisely one nonzero diagonal, an...

متن کامل

Which Digraphs with Ring Structure are Essentially Cyclic?

We say that a digraph is essentially cyclic if its Laplacian spectrum is not completely real. The essential cyclicity implies the presence of directed cycles, but not vice versa. The problem of characterizing essential cyclicity in terms of graph topology is difficult and yet unsolved. Its solution is important for some applications of graph theory, including that in decentralized control. In t...

متن کامل

On matrices with cyclic structure

The relations between several necessary conditions for a square complex matrix A to be m-cyclic are examined. These conditions are known to be equivalent if A is an irreducible nonnegative matrix whose index of imprimitivity is m. In particular, we ®nd that if the digraph of A contains at least one cycle with nonzero signed length, then the following conditions are each equivalent to the m-cycl...

متن کامل

Lower Bounds of Copson Type for Hausdorff Matrices on Weighted Sequence Spaces

Let = be a non-negative matrix. Denote by the supremum of those , satisfying the following inequality: where , , and also is increasing, non-negative sequence of real numbers. If we used instead of The purpose of this paper is to establish a Hardy type formula for , where is Hausdorff matrix and A similar result is also established for where In particular, we apply o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Applied Mathematics

دوره 160  شماره 

صفحات  -

تاریخ انتشار 2012